Insecurity Of Imperfect Quantum Bit Seal

Quantum bit seal is a way to encode a classical bit quantum mechanically so that everyone can obtain non-zero information on the value of the bit. Moreover, such an attempt should have a high chance of being detected by an authorized verifier. Surely, a reader looks for a way to get the maximum amount of information on the sealed bit and at the same time to minimize her chance of being caught. And a verifier picks a sealing scheme that maximizes his chance of detecting any measurement of the sealed bit. Here, I report a strategy that passes all measurement detection procedures at least half of the time for all quantum bit sealing schemes. This strategy also minimizes a reader's chance of being caught under a certain scheme. In this way, I extend the result of Bechmann-Pasquinucci et al. by proving that quantum seal is insecure in the case of imperfect sealed bit recovery.Comment: 4 pages, title changed to better reflect what is exactly proven, to appear in Phys.Lett.

Parity Problem With A Cellular Automaton Solution

The parity of a bit string of length $N$ is a global quantity that can be efficiently compute using a global counter in ${O} (N)$ time. But is it possible to find the parity using cellular automata with a set of local rule tables without using any global counter? Here, we report a way to solve this problem using a number of $r=1$ binary, uniform, parallel and deterministic cellular automata applied in succession for a total of ${O} (N^2)$ time.Comment: Revtex, 4 pages, final version accepted by Phys.Rev.

Self-organized Critical Model Of Biological Evolution

A punctuated equilibrium model of biological evolution with relative fitness between different species being the fundamental driving force of evolution is introduced. Mutation is modeled as a fitness updating cellular automaton process where the change in fitness after mutation follows a Gaussian distribution with mean $x>0$ and standard deviation $\sigma$. Scaling behaviors are observed in our numerical simulation, indicating that the model is self-organized critical. Besides, the numerical experiment suggests that models with different $x$ and $\sigma$ belong to the same universality class. PACS numbers: 87.10.+e, 05.40.+jComment: 8 pages in REVTEX 3.0 with 4 figures (Figures available on request by sending e-mail to [email protected]

Playing The Hypothesis Testing Minority Game In The Maximal Reduced Strategy Space

Hypothesis Testing Minority Game (HMG) is a variant of the standard Minority Game (MG) that models the inertial behavior of agents in the market. In the earlier study of our group, we find that agents cooperate better in HMG than in the standard MG when strategies are picked from the full strategy space. Here we continue to study the behavior of HMG when strategies are chosen from the maximal reduced strategy space. Surprisingly, we find that, unlike the standard MG, the level of cooperation in HMG depends strongly on the strategy space used. In addition, a novel intermittency dynamics is also observed in the minority choice time series in a certain parameter range in which the orderly phases are characterized by a variety of periodic dynamics. Remarkably, all these findings can be explained by the crowd-anticrowd theory.Comment: 12 pages, 7 figures, to appear in Physica

Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible

There had been well known claims of unconditionally secure quantum protocols for bit commitment. However, we, and independently Mayers, showed that all proposed quantum bit commitment schemes are, in principle, insecure because the sender, Alice, can almost always cheat successfully by using an Einstein-Podolsky-Rosen (EPR) type of attack and delaying her measurements. One might wonder if secure quantum bit commitment protocols exist at all. We answer this question by showing that the same type of attack by Alice will, in principle, break any bit commitment scheme. The cheating strategy generally requires a quantum computer. We emphasize the generality of this ``no-go theorem'': Unconditionally secure bit commitment schemes based on quantum mechanics---fully quantum, classical or quantum but with measurements---are all ruled out by this result. Since bit commitment is a useful primitive for building up more sophisticated protocols such as zero-knowledge proofs, our results cast very serious doubt on the security of quantum cryptography in the so-called ``post-cold-war'' applications. We also show that ideal quantum coin tossing is impossible because of the EPR attack. This no-go theorem for ideal quantum coin tossing may help to shed some lights on the possibility of non-ideal protocols.Comment: We emphasize the generality of this "no-go theorem". All bit commitment schemes---fully quantum, classical and quantum but with measurements---are shown to be necessarily insecure. Accepted for publication in a special issue of Physica D. About 18 pages in elsart.sty. This is an extended version of an earlier manuscript (quant-ph/9605026) which has appeared in the proceedings of PHYSCOMP'9

Weighted Assortative And Disassortative Networks Model

Real-world networks process structured connections since they have non-trivial vertex degree correlation and clustering. Here we propose a toy model of structure formation in real-world weighted network. In our model, a network evolves by topological growth as well as by weight change. In addition, we introduce the weighted assortativity coefficient, which generalizes the assortativity coefficient of a topological network, to measure the tendency of having a high-weighted link between two vertices of similar degrees. Network generated by our model exhibits scale-free behavior with a tunable exponent. Besides, a few non-trivial features found in real-world networks are reproduced by varying the parameter ruling the speed of weight evolution. Most importantly, by studying the weighted assortativity coefficient, we found that both topologically assortative and disassortative networks generated by our model are in fact weighted assortative.Comment: 8 pages, minor clarifications, to be published in Physica

Multi-valued Logic Gates for Quantum Computation

We develop a multi-valued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we establish that arbitrary unitary operations on any number of d-level systems (d > 2) can be decomposed into logic gates that operate on only two systems at a time. We show that such multi-valued logic gates are experimentally feasible in the context of the linear ion trap scheme for quantum computing. By using d levels in each ion in this scheme, we reduce the number of ions needed for a computation by a factor of log d.Comment: Revised version; 8 pages, 3 figures; to appear in Physical Review

Unitary designs and codes

A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code - a subset of U(d) in which the trace inner product of any pair of matrices is restricted to only a small number of distinct values - and give an upper bound for the size of a code of degree s in U(d) for any d and s. These bounds can be strengthened when the particular inner product values that occur in the code or design are known. Finally, we describe some constructions of designs: we give an upper bound on the size of the smallest weighted unitary t-design in U(d), and we catalogue some t-designs that arise from finite groups.Comment: 25 pages, no figure

Recent glitches detected in the Crab pulsar

From 2000 to 2010, monitoring of radio emission from the Crab pulsar at Xinjiang Observatory detected a total of nine glitches. The occurrence of glitches appears to be a random process as described by previous researches. A persistent change in pulse frequency and pulse frequency derivative after each glitch was found. There is no obvious correlation between glitch sizes and the time since last glitch. For these glitches $\Delta\nu_{p}$ and $\Delta\dot{\nu}_{p}$ span two orders of magnitude. The pulsar suffered the largest frequency jump ever seen on MJD 53067.1. The size of the glitch is $\sim$ 6.8 $\times 10^{-6}$ Hz, $\sim$ 3.5 times that of the glitch occured in 1989 glitch, with a very large permanent changes in frequency and pulse frequency derivative and followed by a decay with time constant $\sim$ 21 days. The braking index presents significant changes. We attribute this variation to a varying particle wind strength which may be caused by glitch activities. We discuss the properties of detected glitches in Crab pulsar and compare them with glitches in the Vela pulsar.Comment: Accepted for publication in Astrophysics & Space Scienc

Measurements of Cabibbo Suppressed Hadronic Decay Fractions of Charmed D0 and D+ Mesons

Using data collected with the BESII detector at $e^{+}e^{-}$ storage ring Beijing Electron Positron Collider, the measurements of relative branching fractions for seven Cabibbo suppressed hadronic weak decays $D^0 \to K^- K^+$, $\pi^+ \pi^-$, $K^- K^+ \pi^+ \pi^-$ and $\pi^+ \pi^+ \pi^- \pi^-$, $D^+ \to \bar{K^0} K^+$, $K^- K^+ \pi^+$ and $\pi^- \pi^+ \pi^+$ are presented.Comment: 11 pages, 5 figure